Search results for "Gossip algorithms"

showing 2 items of 2 documents

Quantized Dissensus in switching networks with nodes death and duplication* *Research supported by MURST-PRIN “Robust Techniques for uncertain system…

2009

Abstract In this paper we discuss agents exchanging quantized flows to diverge one from the others according to a dissensus protocol. A Quantized Gossip algorithm is considered. Evolutions of the states during switching intervals and at switching instants and their property are described and analyzed. The modeling of switching systems describing networks where death and duplication processes occur is described. Some properties of the topology reached by the network when different rules of duplication and inheritance are implemented.

Property (philosophy)Gossip algorithmsDistributed computingHybrid systemGene duplicationInheritance (genetic algorithm)Topology (electrical circuits)TopologyProtocol (object-oriented programming)MathematicsIFAC Proceedings Volumes
researchProduct

Concurrent and Distributed Projection through Local Interference for Wireless Sensor Networks

2012

In this paper we use a gossip algorithm to obtain the projection of the observed signal into a subspace of lower dimension. Gossip algorithms allow distributed, fast and efficient computations on a Wireless Sensor Network and they can be properly modified to evaluate the sought projection. By combining computation coding with gossip algorithms we proposed a novel strategy that leads to important saving on convergence time as well as exponentially decreasing energy consumption, as the size of the network increases.

Key distribution in wireless sensor networksComputer engineeringGossip algorithmsComputer scienceComputationReal-time computingEnergy consumptionWireless sensor networkSubspace topologyCoding (social sciences)
researchProduct